Correction to: Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations
نویسندگان
چکیده
منابع مشابه
New Concept Discrete Fracture Network Model Simulator, GeoFlow, and Three Dimensional Channeling Flow in Fracture Network
Discrete fracture network (DFN) model simulations, where a fracture network can have a natural heterogeneity, is one of the most effective approaches in fluid flow analyses for naturally fractured and enhanced geothermal reservoirs. In the DFN model simulations, fractures are modeled by a pair of parallel smooth plates although real fractures have rough surfaces. Numerous field and laboratory o...
متن کاملA new conforming mesh generator for three-dimensional discrete fracture networks
Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...
متن کاملMultilevel Graph Partitioning Schemes
In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...
متن کاملParallel Multilevel Graph Partitioning
In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processorCray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 p...
متن کاملNetwork Flow-Based Refinement for Multilevel Hypergraph Partitioning
We present a refinement framework for multilevel hypergraph partitioning that uses max-flow computations on pairs of blocks to improve the solution quality of a k-way partition. The framework generalizes the flow-based improvement algorithm of KaFFPa from graphs to hypergraphs and is integrated into the hypergraph partitioner KaHyPar. By reducing the size of hypergraph flow networks, improving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Geosciences
سال: 2021
ISSN: 1874-8961,1874-8953
DOI: 10.1007/s11004-021-09960-y